Approximation algorithms for network design: A survey

Approximation Algorithms for Network Design: A Survey

In a typical instance of a network design problem, we are given a directed or undirected graph G = (V,E), non-negative edge-costs ce for all e∈E, and our goal is to find a minimum-cost subgraph H of G that satisfies some design criteria. For example, we may wish to find a minimum-cost set of edges that induces a connected graph (this is the minimum-cost spanning tree problem), or we might want ...

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Approximation Algorithms for NETWORK DESIGN AND ORIENTEERING

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P 6 = NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for s...

Approximation Algorithms for a Directed Network Design Problem

We present a 4-approximation algorithm for a class of directed network design problems. The network design problem is to find a minimum cost subgraph such that for each vertex set S there are at least f(S) arcs leaving the set S. In the last 10 years general techniques have been developed for designing approximation algorithms for undirected network design problems. Recently, Kamal Jain gave a ...